A fixpoint theory for non-monotonic parallelism

A Fixpoint Theory for Non-monotonic Parallelism

A Fixpoint Theory for Non-monotonic Parallelism

This paper studies parallel recursion. The trace specification language used in this paper incorporates sequentiality, nondeterminism, reactiveness (including infinite traces), three forms of parallelism (including conjunctive, fair-interleaving and synchronous parallelism) and general recursion. In order to use Tarski’s theorem to determine the fixpoints of recursions, we need to identify a we...

A Process Theory of Non-monotonic Inference

Artificial Intelligence needs a formal theory of the process of non-monotonic reasoning. Ideally, such a theory would decide, for every proposition and state of the process, whether the program should believe the proposition in that state, or remain agnostic. Without non-monotonic inference rules, non-monotonic inferences cannot be explained in the same relational, rule-based fashion as other i...

Rationality Postulates: applying argumentation theory for non-monotonic reasoning

The current review paper examines how to apply Dung’s theory of abstract argumentation to define meaningful forms of non-monotonic inference. The idea is that arguments are constructed using strict and defeasible inference rules, and that it is then examined how these arguments attack (or defeat) each other. The thus defined argumentation framework provides the basis for applying Dungstyle sema...

Non-Monotonic Inference Rules for the Credulous Theory

Most of the theories that model default reasoning by means of defeasible inheritance networks proceed via construction of paths, and are therefore known as `path-based'. In spite of many advantages, these theories also face certain well-known problems. In particular, they do poorly when cyclic nets are at issue or when it comes up to extensions. In this paper we show that these problems may be ...